Adaptive Relative Reflection Harris Hawks Optimization for Global Optimization
نویسندگان
چکیده
The Harris Hawks optimization (HHO) is a population-based metaheuristic algorithm; however, it has low diversity and premature convergence in certain problems. This paper proposes an adaptive relative reflection HHO (ARHHO), which increases the of standard HHO, alleviates problem stagnation local optimal solutions, improves search accuracy algorithm. main features algorithm define nonlinear escape energy weights combine with Furthermore, we prove computational complexity ARHHO Finally, performance our evaluated by comparison other well-known algorithms on 23 benchmark Experimental results show that performs better than compared most functions.
منابع مشابه
Adaptive memory programming for constrained global optimization
The problem of finding a global optimum of a constrained multimodal function has been the subject of intensive study in recent years. Several effective global optimization algorithms for constrained problems have been developed; among them, the multistart procedures discussed in Ugray et al. (2007) are the most effective. We present some new multistart methods based on the framework of adaptive...
متن کاملPure adaptive search for finite global optimization
Pure Adaptive Search is a stochastic algorithm which has been analyzed for continuous global optimization. When a unifonn distribution is used in PAS. it has been shown to have complexity which is linear in dimension. We define strong and weak variations of PAS in the setting of finite global optimization and prove analogous results. In particular, for the n-dimensional lattice {t, ... ,k}n, th...
متن کاملImproved Cuckoo Search Algorithm for Global Optimization
The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...
متن کاملPure adaptive search in global optimization
Pure adaptive seach iteratively constructs a sequence of interior points uniformly distributed within the corresponding sequence of nested improving regions of the feasible space. Tbat is, at any iteration, the hext point in the sequence is uniformly distributed over the region of feasible space containing all points that are strictly superior in value to the previous points in the sequence. Th...
متن کاملHybrid Seeker Optimization Algorithm for Global Optimization
Swarm intelligence algorithms have been succesfully applied to hard optimization problems. Seeker optimization algorithm is one of the latest members of that class of metaheuristics and it has not yet been thorougly researched. Since the early versions of this algorithm were less succesful with multimodal functions, we propose in this paper hybridization of the seeker optimization algorithm wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10071145